Axioms of Causal Relevance
نویسندگان
چکیده
This paper develops a set of graphoid-like axioms for causal relevance, that is, statements of the form: \Changing X will not aaect Y if we hold Z constant". Both a probabilistic and deterministic deenition of causal irrelevance are proposed. The probabilistic definition allows for only two axioms, unless stability is assumed. Under the stability assumption, probabilis-tic causal irrelevance is equivalent to path interception in cyclic graphs. The deterministic deenition allows for all of the axioms of path interception in cyclic graphs, with the exception of transitivity.
منابع مشابه
A Calculus for Causal Relevance
We present a sound and complete calculus for causal relevance that uses Pearl’s functional causal models as semantics. The calculus consists of axioms and rules of inference for reasoning about causal relevance relationships. We extend the set of known axioms for causal relevance with new axioms and rules of inference. The axioms are then divided into different sets for reasoning about specific...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملBASE AXIOMS AND SUBBASE AXIOMS IN M-FUZZIFYING CONVEX SPACES
Based on a completely distributive lattice $M$, base axioms and subbase axioms are introduced in $M$-fuzzifying convex spaces. It is shown that a mapping $mathscr{B}$ (resp. $varphi$) with the base axioms (resp. subbase axioms) can induce a unique $M$-fuzzifying convex structure with $mathscr{B}$ (resp. $varphi$) as its base (resp. subbase). As applications, it is proved that bases and subbase...
متن کاملSRASS - A Semantic Relevance Axiom Selection System
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a conjecture. The selection is determined by semantics of the axioms and conjecture, ordered heuristically by a syntactic relevance measure. The system is able to solve many problems that cannot be solved alone by the u...
متن کاملCausality and Unification: How Causality Unifies Statistical Regularities
Two key ideas of scientific explanation −explanation as causal information and explanation as unification– have frequently been set into mutual opposition. This paper proposes a “dialectical solution” to this conflict, by arguing that causal explanations are preferable to non-causal ones, because they lead to a higher degree of unification at the level of explaining statistical regularities. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 97 شماره
صفحات -
تاریخ انتشار 1997